A Review of Joint Source-Channel Coding
نویسنده
چکیده
This article presents methods for robust and efficient communication over wireless channels. Both benefits and limitations of the classical approach of separate source and channel coding are discussed. Joint source-channel coding (JSCC) is presented as the most promising scheme for communication of analogue sources over wireless channels, due to its ability to cope with varying channel qualities and to approach the theoretical bounds of transmission rates. Different schemes for implementing joint source-channel coding are presented, ranging from a traditional tandem structure with resource control to hybrid digital-analogue JSCC techniques providing both bandwidth reduction and expansion. The direct source-channel mapping schemes are shown to be good candidates for joint source-channel coding, providing both robustness and efficiency.
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملJoint Source and Channel Coding for Image Transmission Over LossyPacket
We describe a joint source/channel allocation scheme for transmitting images lossily over block erasure channels such as the Internet. The goal is to reduce image transmission latency. Our subband-level and bitplane-level optimization procedures give rise to an embedded channel coding strategy. Source and channel coding bits are allocated in order to minimize an expected distortion measure. Mor...
متن کاملFinite-Length Bounds for Joint Source-Channel Coding with Markovian Source and Additive Channel Noise to Achieve Large and Moderate Deviation Bounds
We derive novel upper and lower finite-length bounds of the error probability in joint source-channel coding when the source obeys the ergodic Markov process and the channel is a Markovian additive channel or a Markovian conditional additive channel. These bounds achieve the tight bounds in the large and moderate deviation regimes. Index Terms Markov chain, joint source-channel coding, finite-l...
متن کاملDeep Learning for Joint Source-Channel Coding of Text
We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach to this problem in both theory and practice involves performing source coding to first compress the text and then channel coding to add robustness for the transmission across the channel. This approach is optimal in terms of minimizing end-to-end dist...
متن کاملRecent Advances in Joint Source-Channel Coding of Video
It has recently been shown that for an image or video transmission scheme to be both eecient and robust in practice that a joint source-channel coding approach is necessary. In this work, we discuss recent eeorts in the eld of joint source-channel coding of images and video. We then present a general methodology for determining the optimal tradeoo between source and channel coding as a function...
متن کامل